/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 26727
 * Date: 2024-01-26
 * Time: 21:20
 */
class MyCircularQueue {

    private int[] elem;
    private int front;
    private int rear;

    public MyCircularQueue(int k) {
         this.elem = new int[k];//[k+1]多浪费一个空间
    }

    //入队记得判断队列是否满了
    public boolean enQueue(int value) {
      if(isFull()) {
          return false;
      }
      elem[rear] = value;
      rear = (rear+1)% elem.length;
      return true;
    }

    //出队列考虑空不空
    public boolean deQueue() {
       if(isEmpty()) {
           return false;
       }
       front = (front+1)%elem.length;
       return true;
    }

    public int Front() {
       if(isEmpty()){
           return -1;
       }
       return elem[front];
    }

    public int Rear() {
    if(isEmpty()) {
        return -1;
    }
    int index = (rear == 0)? elem.length-1 :rear-1;
    return elem[index];
    }

    public boolean isEmpty() {
        return front == rear;
    }

    public boolean isFull() {
        return front == (rear+1) % elem.length;
    }
}
